Practical algorithms for multivariate rational approximation
نویسندگان
چکیده
We present two approaches for computing rational approximations to multivariate functions, motivated by their effectiveness as surrogate models high-energy physics (HEP) applications. Our first approach builds on the Stieltjes process efficiently and robustly compute coefficients of approximation. second is based an optimization formulation that allows us include structural constraints approximation (in particular, demanding absence singularities), resulting in a semi-infinite problem we solve using outer approach. results synthetic real-life HEP data, compare quality our with traditional polynomial approximations.
منابع مشابه
Comparison of Algorithms for Multivariate Rational Approximation
Let F be a continuous real-valued function defined on the unit square [—1,11 x [-1, 1]. When developing the rational product approximation to F, a certain type of discontinuity may arise. We develop a variation of a known technique to overcome this discontinuity so that the approximation can be programmed. Rational product approximations to F have been computed using both the second algorithm o...
متن کاملMultivariate Rational Approximation
We estimate the error in approximating a function f by rational functions of degree n in the norm of Lq(Q), Q := [0,1]d. Among other things, we prove that if f is in the Sobolev space Wk(Q) and if k/d l/p + l/q > O, then f can be approximated by rational functions of degree n to an order O(n-k/d).
متن کاملError formulas for multivariate rational interpolation and Pad6 approximation
The univariate error formulas for Pad6 approximants and rational interpolants, which are repeated in Section 2, are generalized to the multivariate case in Section 4. We deal with "general order" multivariate Pad~ approximants and rational interpolants, where the numerator and denominator polynomials as well as the equations expressing the approximation order, can be chosen by the user of these...
متن کاملMultivariate n-term rational and piecewise polynomial approximation
We study nonlinear approximation in Lp(R) (0 < p < ∞, d > 1) from (a) n-term rational functions, and (b) piecewise polynomials generated by different anisotropic dyadic partitions of Rd. To characterize the rates of each such piecewise polynomial approximation we introduce a family of smoothness spaces (B-spaces) which can be viewed as an anisotropic variation of Besov spaces. We use the B-spac...
متن کاملA Comparison of Algorithms for Rational / œ Approximation
Results are reported of a numerical study to compare eight algorithms for obtaining rational L approximations. The algorithms investigated are Loeb's algorithm, the linear inequality algorithm, the Osborne-Watson algorithm, the differential correction algorithms I, II and III, the Remes algorithm and Maehly's algorithm. The results of the study indicate that the Remes algorithm and the differen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Physics Communications
سال: 2021
ISSN: ['1879-2944', '0010-4655']
DOI: https://doi.org/10.1016/j.cpc.2020.107663